Digital Graphic Communities: Webcomics and E-Graphic Medicine in Combating Mental Diseases.
نویسندگان
چکیده
منابع مشابه
Analyzing registry, log files, and prefetch files in finding digital evidence in graphic design applications
The products of graphic design applications leave behind traces of digital information which can be used during a digital forensic investigation in cases where counterfeit documents have been created. This paper analyzes the digital forensics involved in the creation of counterfeit documents. This is achieved by first recognizing the digital forensic artifacts left behind from the use of graphi...
متن کاملOn potentially (K4-e)-graphic sequences
In this paper, we characterize the potentially (K4 − e)-graphic sequences where K4 − e is the graph obtained from K4 by removing one edge. This characterization implies a theorem due to C. H. Lai (Australas. J. Combin. 24 (2001), 123–127) and a characterization of potentially C4graphic sequences due to R. Luo (Ars Combin. 64 (2002), 301–318).
متن کاملAssociation Between the Prevalence of Common Diseases and Demo-Graphic, Occupational Factors in Elderly Staff in IRIB in 2010
Objectives: The purpose of this study was to explaine the association between the prevalence of common diseases and demographic, occupotional factors in elderly staff in IRIB (Tehran center) Regarding the increasing of elderly populationin the world, indluding IRAN, the prevalence of the physical disability in this age range is raised which leads to several unfavarable out comes such as: hospit...
متن کاملOn the Special Properties of Graphic and Co-graphic Bondgraphs
The special combinatorial properties of graphic and co-graphic bondgraphs are analysed. A graphic bondgraph is one which has an associated graph, meaning that the two represent the same combinatorial information, expressed in thej’unctions of the bondgraph or the cycles of the graph. Dually a co-graphic bondgraph is one whose dual bondgraph has an associated graph. The combinatorial basis for c...
متن کاملGraphic Submodular Function Minimization: A Graphic Approach and Applications
We develop an efficient and conceptually simple algorithm for minimizing the sum of the rank-function of a graph G = (V,E) and of a linear function on E. We call such set-functions “graphic submodular”. The algorithm we present for graphic submodular function minimization is a greedy algorithm consisting of |V | − 1 steps, where the steps require the solution of a network flow problem on subgra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sanglap : journal of literary and cultural inquiry
سال: 2023
ISSN: ['2349-8064']
DOI: https://doi.org/10.35684/jlci.2023.9204